The spanning ratios of beta-Skeleton
نویسندگان
چکیده
In this paper we study the spanning ratio of the βskeletons for β ∈ [0, 2]. Both our upper-bounds and lower-bounds improve the previously best known results [10, 12].
منابع مشابه
The spanning ratios of -Skeletons
In this paper we study the spanning ratio of the -skeleton for 2 [0; 2]. Both our upper-bounds and lower-bounds improve the previously best known results [10], [12].
متن کاملGeneralized $\beta$-skeletons
β-skeletons, a prominent member of the neighborhood graph family, have interesting geometric properties and various applications ranging from geographic networks to archeology. This paper focuses on developing a new, more general than the present one, definition of β-skeletons based only on the distance criterion. It allows us to consider them in many different cases, e.g. for weighted graphs o...
متن کاملEssential Constraints of Edge-Constrained Proximity Graphs
Given a plane forest F = (V,E) of |V | = n points, we find the minimum set S ⊆ E of edges such that the edge-constrained minimum spanning tree over the set V of vertices and the set S of constraints contains F . We present an O(n logn)-time algorithm that solves this problem. We generalize this to other proximity graphs in the constraint setting, such as the relative neighbourhood graph, Gabrie...
متن کاملThe augmented Zagreb index, vertex connectivity and matching number of graphs
Let $Gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. Denote by $Upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. In the classes of graphs $Gamma_{n,kappa}$ and $Upsilon_{n,beta}$, the elements having maximum augmented Zagreb index are determined.
متن کاملConnectivity of Random Geometric Graphs Related to Minimal Spanning Forests
The a.s. connectivity of the Euclidean minimal spanning forest MSF(X) on a homogeneous Poisson point process X ⊂ R is an open problem for dimension d > 2. We introduce a descending family of graphs (Gn)n≥2 that can be seen as approximations to the MSF in the sense that MSF(X) = ⋂∞ n=2Gn(X). For n = 2 one recovers the relative neighborhood graph or, in other words, the β-skeleton with β = 2. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003